On-line Chain Partitioning of Up-growing Interval Orders
نویسندگان
چکیده
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5 w −1 4 chains to cover poset of width w. Felsner [3] introduced a variant of this problem considering only up-growing posets, i.e. on-line posets in which each new point is maximal at the moment of its arrival. He presented an algorithm using (
منابع مشابه
On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders
We analyze special cases of the on-line chain partition problem of up-growing orders. One result is a lower bound for 2-dimensional orders. Together with the old upper bound this yields the precise value of this game which is ` w+1 2 ́ as usual w is the width of the order. Our main contribution is the analysis of the game for semi-orders. Surprisingly the golden ratio comes into play, the precis...
متن کاملOn-line Chain Partitioning Approach to Scheduling
An on-line chain partitioning algorithm receives the points of the poset from some externally determined list. Being presented with a new point the algorithm learns the comparability status of this new point to all previously presented ones. As each point is received, the algorithm assigns this new point to a chain in an irrevocable manner and this assignment is made without knowledge of future...
متن کاملOn-Line Chain Partitions of Orders
We analyze the on-line chain partitioning problem as a two-person game. One person builds an order one point at a time. The other person responds by making an irrevocable assignment of the new point to a chain of a chain partition. Kierstead gave a strategy showing that width k orders can be on-line chain partitioned into (5 k ?1)=4 chains. We rst prove that width two orders can be partitioned ...
متن کاملOn-Line Chain Partitions of Orders: A Survey
On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents, point by point, a partially ordered set. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of the order. The value of the game for orders of width w is a minimum number val(w) such that Algorithm has a strategy using at most val(w) chains o...
متن کاملOn-line Chain Partitions of Up-growing Semi-orders
On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents a partially ordered set, point by point. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of the order. The value of the game for orders of width w is a minimum number val(w) such that Algorithm has a strategy using at most val(w) chains on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 24 شماره
صفحات -
تاریخ انتشار 2007